Improved Beam Search for Optimizing No-Wait Flowshops With Release Times
نویسندگان
چکیده
منابع مشابه
No-Wait Flowshops to Minimize Total Tardiness with Setup Times
The m-machine no-wait flowshop scheduling problem is addressed where setup times are treated as separate from processing times. The objective is to minimize total tardiness. Different dispatching rules have been investigated and three were found to be superior. Two heuristics, a simulated annealing (SA) and a genetic algorithm (GA), have been proposed by using the best performing dispatching ru...
متن کاملNo-wait flowshops with bicriteria of makespan and maximum lateness
In this work we study a flowshop scheduling problem in which jobs are not allowed to wait in-between machines, a situation commonly referred to as no-wait. The concerned criterion is to minimize a weighted sum of makespan and maximum lateness. A dominance relation for the case of three-machine is presented and evaluated by experimental designs. Several heuristics and local search methods are pr...
متن کاملLotstreaming with Equal Sublots in No-wait Flowshops
We consider the problem of minimizing makespan in a no-wait flow-shop with an arbitrary number of machines. We assume that all sublots have the same number of items. We consider the cases with or without loading times. In both cases we show the existence of a critical machine which never remains idle. Then we get a set of general conditions on the processing times and loading times, which bind ...
متن کاملNew Heuristics for No-Wait Flowshops with Performance Measures of Makespan and Mean Completion Time
The m-machine no-wait flowshop scheduling problem is addressed by taking into account two performance measures of makespan and mean completion time. The objective is to minimize makespan such that mean completion time is less than a certain value. A dominance relation is provided for a special case of the problem. Moreover, two new heuristics are proposed in this paper. Computational analysis...
متن کاملAlgorithms for no-wait flowshops with total completion time subject to makespan
The m-machine no-wait flowshop scheduling problem, with the objective of minimizing total completion time subject to the constraint that makespan has to be less than or equal to a certain value, is addressed in this paper. First, an algorithm is proposed to find an upper bound on the makespan in case the upper bound is not given or unknown. Given the upper bound on makespan, a proposed algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3015737